perfect secrecy

perfect secrecy
идеальная секретность

Англо-русский словарь по компьютерной безопасности. . 2011.

Игры ⚽ Нужно решить контрольную?

Смотреть что такое "perfect secrecy" в других словарях:

  • Perfect forward secrecy — In an authenticated key agreement protocol that uses public key cryptography, perfect forward secrecy (or PFS) is the property that ensures that a session key derived from a set of long term public and private keys will not be compromised if one… …   Wikipedia

  • Perfect forward secrecy — Совершенная прямая секретность (англ. Perfect forward secrecy, PFS[1])  свойство некоторых протоколов согласования ключа (Key agreement), которое гарантирует, что сессионные ключи, полученные при помощи набора открытых и закрытых ключей …   Википедия

  • Perfect Forward Secrecy — Folgenlosigkeit (engl. perfect forward secrecy, PFS; auf deutsch etwa „perfekt fortgesetzte Geheimhaltung“) bedeutet in der Kryptographie die Eigenschaft von Verschlüsselungsverfahren, dass aus einem aufgedeckten Schlüssel nicht auf vorhergehende …   Deutsch Wikipedia

  • One-time pad — Excerpt from a one time pad In cryptography, the one time pad (OTP) is a type of encryption, which has been proven to be impossible to crack if used correctly. Each bit or character from the plaintext is encrypted by a modular addition with a bit …   Wikipedia

  • Key size — In cryptography, key size or key length is the size measured in bits[1] of the key used in a cryptographic algorithm (such as a cipher). An algorithm s key length is distinct from its cryptographic security, which is a logarithmic measure of the… …   Wikipedia

  • Cypherpunk — Not to be confused with Cyberpunk. A cypherpunk is an activist advocating widespread use of strong cryptography as a route to social and political change. Originally communicating through the Cypherpunks electronic mailing list, informal groups… …   Wikipedia

  • Brute force attack — In cryptanalysis, a brute force attack is a method of defeating a cryptographic scheme by trying a large number of possibilities; for example, possible keys in order to decrypt a message. In most schemes, the theoretical possibility of a brute… …   Wikipedia

  • Cryptographically secure pseudorandom number generator — A cryptographically secure pseudo random number generator (CSPRNG) is a pseudo random number generator (PRNG) with properties that make it suitable for use in cryptography. Many aspects of cryptography require random numbers, for example: Key… …   Wikipedia

  • Running key cipher — In classical cryptography, the running key cipher is a type of polyalphabetic substitution cipher in which a text, typically from a book, is used to provide a very long keystream. Usually, the book to be used would be agreed ahead of time, while… …   Wikipedia

  • Rao Tula Ram — Infobox revolution biography name= Rao Tula Ram alternate name= caption= dateofbirth= Birth date|1825|12|9 placeofbirth= dateofdeath= placeofdeath= movement= Indian Rebellion Of 1857 organizations= monuments= prizes= religion= influences=… …   Wikipedia

  • Bhagat Jaidev — whose 2 hymns are found in the Guru Granth Sahib is the celebrated Sanskrit poet who wrote the Gitgovind . His father was Bhoidev, a Hindu Brahman, and his mother Bamdevi. He was born at Kenduli Sasan, a village near Puri in Orissa. Young… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»